1 research outputs found

    New constructions of non-regular cospectral graphs

    Full text link
    We consider two types of joins of graphs G1G_{1} and G2G_{2}, G1⊻G2G_{1}\veebar G_{2} - the Neighbors Splitting Join and G1∨=G2G_{1}\underset{=}{\lor}G_{2} - the Non Neighbors Splitting Join, and compute the adjacency characteristic polynomial, the Laplacian characteristic polynomial and the signless Laplacian characteristic polynomial of these joins. When G1G_{1} and G2G_{2} are regular, we compute the adjacency spectrum, the Laplacian spectrum, the signless Laplacian spectrum of G1∨=G2G_{1}\underset{=}{\lor}G_{2} and the normalized Laplacian spectrum of G1⊻G2G_{1}\veebar G_{2} and G1∨=G2G_{1}\underset{=}{\lor}G_{2}. We use these results to construct non regular, non isomorphic graphs that are cospectral with respect to the four matrices: adjacency, Laplacian , signless Laplacian and normalized Laplacian
    corecore